package com.wfm.leetcode.editor.cn;
public class POne143最长公共子序列{
//leetcode submit region begin(Prohibit modification and deletion)
class Solution {
    public int longestCommonSubsequence(String text1, String text2) {
        int m = text1.length();
        int n = text2.length();
        int[][] dp = new int[m][n];
        if(text1.charAt(0)==text2.charAt(0)) dp[0][0]=1;
        else dp[0][0]=0;
        for (int i = 1; i < m; i++) {
            if(text1.charAt(i)==text2.charAt(0)) dp[i][0]=1;
            else dp[i][0]=dp[i-1][0];
        }
        for (int i = 1; i < n; i++) {
            if(text1.charAt(0)==text2.charAt(i)) dp[0][i]=1;
            else dp[0][i]=dp[0][i-1];
        }
        for (int i = 1; i < m; i++) {
            for (int j = 1; j < n; j++) {
                if(text1.charAt(i)==text2.charAt(j)){
                    dp[i][j]=dp[i-1][j-1]+1;
                }else {
                    dp[i][j]=Math.max(dp[i][j-1],dp[i-1][j]);
                }
            }
        }
        return dp[m-1][n-1];
    }
}
//leetcode submit region end(Prohibit modification and deletion)

    public static void main(String[] args) { 
        Solution solution = new POne143最长公共子序列().new Solution();
    }
}